منابع مشابه
k-edge Subgraph Problems
We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of “spanning” to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximize the total weight of the nodes. We discuss the complexity of this problem and other related problems with different concepts of “spanning” and show t...
متن کاملApproximating k-outconnected Subgraph Problems
We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for nding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle th...
متن کاملOn the minimum-cost λ-edge-connected k-subgraph problem
In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost λ -edge-connected k-subgraph problem, or the (k,λ )-subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if λ = 1), λ -edgeconnected spanning subgraph problem (if k = |V |) and k-clique problem (if λ = k−1 and...
متن کاملHeuristics for the K-Cardinality Tree and Subgraph Problems
In this paper we consider the problem of nding in a given graph a minimal weight subtree or connected subgraph, which has a given number of edges. These NP-hard combinatorial optimization problems have various applications in the oil industry, in facility layout and graph partitioning. We will present diierent heuristic approaches based on spanning tree and shortest path methods and on an exact...
متن کاملStrong Subgraph $k$-connectivity
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations of undirected graphs. In this paper, we introduce a natural extension of generalized k-connectivity of undirected graphs to directed graphs (we call it stro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00030-3